Iterating Semantic Automata
نویسنده
چکیده
The semantic automata framework, developed originally in the 1980s, provides computational interpretations of generalized quantifiers. While recent experimental results have associated structural features of these automata with neuroanatomical demands in processing sentences with quantifiers, the theoretical framework has remained largely unexplored. In this paper, after presenting some classic results on semantic automata in a modern style, we present the first application of semantic automata to polyadic quantification, exhibiting automata for iterated quantifiers. We also discuss the role of semantic automata in linguistic theory and offer new empirical predictions for sentence processing with embedded quantifiers.
منابع مشابه
Iterating Inverse Binary Transducers
We study iterated transductions defined by a class of inverse transducers over the binary alphabet. The transduction semigroups of these automata turn out to be free Abelian groups and the orbits of finite words can be described as affine subspaces in a suitable geometry defined by the generators of these groups. We show that iterated transductions are rational for a subclass of our automata.
متن کاملIterating Invertible Binary Transducers
We study iterated transductions defined by a class of invertible transducers over the binary alphabet. The transduction semigroups of these automata turn out to be free Abelian groups and the orbits of finite words can be described as affine subspaces in a suitable geometry defined by the generators of these groups. We show that iterated transductions are rational for a subclass of our automata.
متن کاملTree Automata for Non-linear Arithmetic
Tree automata modulo associativity and commutativity axioms, called AC tree automata, accept trees by iterating the transition modulo equational reasoning. The class of languages accepted by monotone AC tree automata is known to include the solution set of the inequality x × y > z, which implies that the class properly includes the AC closure of regular tree languages. In the paper, we characte...
متن کاملSelf-organization in Cellular Automata: A Particle-Based Approach
For some classes of cellular automata, we observe empirically a phenomenon of self-organization: starting from a random configuration, regular strips separated by defects appear in the space-time diagram. When there is no creation of defects, all defects have the same direction after some time. In this article, we propose to formalise this phenomenon. Starting from the notion of propagation of ...
متن کاملResearch of Encryption Based on Chaotic Cellular Automata
In this paper we proposed a block cryptosystem based on 1d-k5 Chain C CA, by alternatively iterating leftand right-toggle chain rules, this kind of encryption is achieved by backward iteration and decryption is realized via forward iteration. From theory proof, we can ensure the security of the cryptosystem, and make mostly confusion and diffusion function. Experimant shows that this cryptosyst...
متن کامل